-
1 constraint satisfaction method
Большой англо-русский и русско-английский словарь > constraint satisfaction method
-
2 constraint satisfaction method
Вычислительная техника: метод поиска допустимого решения (не обязательно оптимального), метод поиска допустимого решения (не обязательно оптимального). удовлетворенческий методУниверсальный англо-русский словарь > constraint satisfaction method
-
3 constraint satisfaction method
метод поиска допустимого решения ( не обязательно оптимального), проф. удовлетворенческий методEnglish-Russian dictionary of computer science and programming > constraint satisfaction method
-
4 method
1) метод; способ (см. тж. technique 1)2) ООП метод (функция - элемент определения класса (class) в языке Smalltalk, в C++ - см. member function)•- alphageometric method
- Amble's method
- ancestor method
- assembly method
- basic access method
- bibliography method
- bit-level method
- branch and bounds method
- buffering method
- building-block method
- chaining method
- checksum method
- coded pattern method
- conditional delay method
- constraint satisfaction method
- critical path method
- cut-and-try method
- cutset method
- dark-spot method
- data access method
- deductive method
- derivative approximation method
- diagonal method
- diagram method
- dichotomy method
- digital sorting method
- direct access method
- exhaustive method
- false position method
- finished method
- finitary method
- finite difference method
- flip-chip method
- flooding method
- flowgraph method
- frequency analysis method
- gradient method
- graphic access method
- heuristic method
- hierarchical access method
- hit-and-miss method
- Horner's method
- hunt-and-stick method
- index register method
- indexed-sequential access method
- inline-code method
- inverse power method
- inverse transformation method
- issue method
- iteration method
- least-squares method
- left-edge method
- lightweight formal method
- linkage method
- longest route method
- machine method
- maximum-likelihood method
- method of quickest descent
- method of selected point
- method of successive approximations
- Monte-Carlo method
- net method
- Newton's method
- nonrestoring method
- N-pass method
- numerical method
- operational method
- opposition method
- overlay method
- part-continuous method
- partitioned access method
- pencil-and-paper method
- perturbation method
- piezoelectric sensing method
- ping-pong method
- power method
- predictor-corrector method
- programming method
- progressive-part method
- proprietary method
- pure virtual method
- queued access method
- queued indexed sequential access method
- radial exploration method
- random-walk method
- recursive descendant method
- regular falsi method
- resetting method
- resident access method
- review article method
- row-by-row method
- rubber band method
- Runge-Kutta method
- saddle point method
- sampling method
- scale factor method
- scan-set method
- scheduling method
- scissors and paste method
- secant method
- sectioning method
- semigroup method
- sequential access method
- shortcut method
- shortcut multiplication method
- sieve method
- simplex method
- single-path instruction method
- sit-by-me instuction method
- state-space method
- steepest descent method
- step-by-step method
- stroke method
- subject profile method
- symbolic method
- symbolical method
- syntactic method
- synthetic method
- target method
- telecommunication access method
- temporal difference method
- time-domain method
- touch method with ten fingers
- trial-and-error method
- truth table method
- variable separation method
- variable-metric method
- variational method
- variation method
- V-brush method
- vernier pulse-timing method
- virtual method
- wire-wrap method
- zero-deflection methodEnglish-Russian dictionary of computer science and programming > method
-
5 метод поиска допустимого решения
Information technology: constraint satisfaction method (не обязательно оптимального)Универсальный русско-английский словарь > метод поиска допустимого решения
-
6 метод поиска допустимого решения (не обязательно оптимального). удовлетворенческий метод
Information technology: constraint satisfaction methodУниверсальный русско-английский словарь > метод поиска допустимого решения (не обязательно оптимального). удовлетворенческий метод
-
7 метод поиска допустимого решения . удовлетворенческий метод
Information technology: (не обязательно оптимального) constraint satisfaction methodУниверсальный русско-английский словарь > метод поиска допустимого решения . удовлетворенческий метод
См. также в других словарях:
Constraint satisfaction problem — Constraint satisfaction problems (CSP)s are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations. CSPs represent the entities in a problem as a homogeneous collection of finite… … Wikipedia
Constraint satisfaction dual problem — The dual problem is a reformulation of a constraint satisfaction problem expressing each constraint of the original problem as a variable. Dual problems only contain binary constraints, and are therefore solvable by algorithms tailored for such… … Wikipedia
Decomposition method (constraint satisfaction) — In constraint satisfaction, a decomposition method translates a constraint satisfaction problem into another constraint satisfaction problem that is binary and acyclic. Decomposition methods work by grouping variables into sets, and solving a… … Wikipedia
Local search (constraint satisfaction) — In constraint satisfaction, local search is an incomplete method for finding a solution to a problem. It is based on iteratively improving an assignment of the variables until all constraints are satisfied. In particular, local search algorithms… … Wikipedia
Constraint logic programming — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concurrent computing … Wikipedia
Constraint optimization — In constraint satisfaction, constrained optimization (also called constraint optimization) seeks for a solution maximizing or minimizing a cost function. Contents 1 Definition 2 Solution methods 2.1 Branch and bound … Wikipedia
Distributed constraint optimization — (DCOP or DisCOP) is the distributed analogue to constraint optimization. A DCOP is a problem in which a group of agents must distributedly choose values for a set of variables such that the cost of a set of constraints over the variables is… … Wikipedia
Concurrent constraint logic programming — is a version of constraint logic programming aimed primarily at programming concurrent processes rather than (or in addition to) solving constraint satisfaction problems. Goals in constraint logic programming are evaluated concurrently; a… … Wikipedia
Decomposition method — is a generic term for solutions of various problems and design of algorithms in which the basic idea is to decompose the problem into question into subproblems. The term may specifically refer to one of the following. Decomposition method… … Wikipedia
Guided Local Search — is a metaheuristic search method. A meta heuristic method is a method that sits on top of a local search algorithm to change its behaviour. Guided Local Search builds up penalties during a search. It uses penalties to help local search algorithms … Wikipedia
Mathematical optimization — For other uses, see Optimization (disambiguation). The maximum of a paraboloid (red dot) In mathematics, computational science, or management science, mathematical optimization (alternatively, optimization or mathematical programming) refers to… … Wikipedia
